#ifndef compress_h
#define conpress_h

#include <limits>
#include <algorithm>
#include "tree.h"

#define M_LN2      0.69314718055994530942 
#define M_LOG2E    1.4426950408889634074E0
#define HUGEVAL     numeric_limits<int>::max()

vektor smallest_cell( vektor cell1 , vektor cell2 , double &sizec );

//vektor smallest_cell2( vektor cell1 , vektor cell2 , double &sizec );

void sort_particles( particlePtr partList , long N , double rootlength );

void resort_particles( particlePtr partList , long N );


bool isInCell( vektor point , vektor cell , double cellsize );


int whichchild2( vektor particle , vektor root );

#endif
